Comments on Cut-Set Bounds on Network Function Computation
نویسندگان
چکیده
منابع مشابه
On capacitated network design cut-set polyhedra
This paper provides an analysis of capacitated network design cut–set polyhedra. We give a complete linear description of the cut–set polyhedron of the single commodity – single facility capacitated network design problem. Then we extend the analysis to single commodity – multifacility and multicommodity – multifacility capacitated network design problems. Valid inequalities described here are ...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولComments on Form Factor Bounds
Improved model independent upper bounds on the weak transition form factors are derived using inclusive sum rules. Comparison of the new bounds with the old ones is made for the form factors hA1 and hV in B → D decays. [email protected] 1 A set of model independent bounds has been derived to provide a restriction on the shape of weak transition form factors [1–3]. They have been extensive...
متن کاملExplicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation
The problem of automating rate region converse proofs in multi-source network coding is considered, and an algorithm for explicitly computing polyhedral outer bounds on the rate regions of multi-source network coding instances using known bounds on the entropy function region is proposed. This algorithm is based on the Convex Hull Method, which is an algorithm to compute projections of polyhedr...
متن کاملProperties of bounds on computation
Partial recursive functions which equal the amount of time or space required by computations have special properties which distinguish them from arbitrary partial recursive functions. Our main result illustrates a property of running times similar in interpretation to Borodin's gap theorem. The proof is based on the construction of difficult to compute characteristic functions which take the va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2827405